Grouping Queries with SV-Semantics in Preference SQL

نویسندگان

  • Markus Endres
  • Patrick Roocks
  • Manuel Huber
  • Werner Kießling
چکیده

Preference database queries become more and more important in Data Warehousing or Decision Support Systems. In these environments the standard SQL GROUP BY operation with aggregate functions is extensively used in formulating queries. In this paper, we focus on the novel GROUPING functionality of Preference SQL which substantially extends the common aggregation features of SQL GROUP BY. It fully supports the Substitutable Values semantics for preference queries, enriched by comfortable aliasing mechanisms. This yields to an increased intuitive readability of complex queries, which in turn can reduce clearly the cognitive load for OLAP programmers. In addition we show how a correlated subquery in SQL can be written simpler and evaluated faster using the GROUPING clause.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preference Queries with SV-Semantics

Personalization of database queries requires a semantically rich, easy to handle and flexible preference model. Building on preferences as strict partial orders we provide a variety of intuitive base preference constructors for numerical and categorical data, including so-called d-parameters. As a novel semantic concept for complex preferences we introduce the notion of ‘substitutable values’ (...

متن کامل

Preference Constructors for Deeply Personalized Database Queries

Deep personalization of database queries requires a semantically rich, easy to handle and flexible preference model. Building on preferences as strict partial orders we provide a variety of intuitive and customizable base preference constructors for numerical and categorical data. For complex constructors we introduce the notion of ‘substitutable values’ (SV-semantics). Preferences with SV-sema...

متن کامل

Generating SQL Queries from SBVR Rules

Declarative technologies have made great strides in expressivity between SQL and SBVR. SBVR models are more expressive that SQL schemas, but not as imminently executable yet. In this paper, we complete the architecture of a system that can execute SBVR models. We do this by describing how SBVR rules can be transformed into SQL DML so that they can be automatically checked against the database u...

متن کامل

Evaluation of Conditional Preference Queries

The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines. A lot of recent research work has been dedicated to this topic in the artificial intelligence and database fields. Several formalisms allowing preference reasoning and specification have been proposed in the AI domai...

متن کامل

Full predicate coverage for testing SQL database queries

In the field of database applications a considerable part of the business logic is implemented using a semi-declarative language: the Structured Query Language (SQL). Because of the different semantics of SQL compared to other procedural languages, the conventional coverage criteria for testing are not directly applicable. This paper presents a criterion specifically tailored for SQL queries (S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014